Improved wild horse optimization with levy flight algorithm for effective task scheduling in cloud computing
نویسندگان
چکیده
Abstract Cloud Computing, the efficiency of task scheduling is proportional to effectiveness users. The improved algorithm (also known as Wild Horse Optimization, or IWHO) proposed address problems lengthy time, high-cost consumption, and high virtual machine load in cloud computing scheduling. First, a distribution model built, with cost, machines primary factors. Second, feasible plan for each whale individual corresponding find best individual, which plan; better optimal we use inertial weight strategy Improved optimization improve local search ability effectively prevent from reaching premature convergence. To deliver services access shared resources, Computing (CC) employs service provider (CSP). In CC context, has significant impact on resource utilization overall system performance. It Nondeterministic Polynomial (NP)-hard problem that solved using metaheuristic techniques job environment. This incentive used this study provide Optimization Levy Flight Algorithm Task Scheduling (IWHOLF-TSC) approach, an wild horse levy flight can be addressed environment by utilizing some form symmetry, achieve optimization, such balancing energy efficiency. IWHOLF-TSC technique constructs multi-objective fitness function reducing Makespan maximizing platform. combines (WHO) theory (LF). WHO inspired social behaviours horses. approach's performance validated, results evaluated variety methods. simulation revealed outperformed others situations.
منابع مشابه
Optimization Task Scheduling Algorithm in Cloud Computing
Since software systems play an important role in applications more than ever, the security has become one of the most important indicators of softwares.Cloud computing refers to services that run in a distributed network and are accessible through common internet protocols. Presenting a proper scheduling method can lead to efficiency of resources by decreasing response time and costs. This rese...
متن کاملoptimization task scheduling algorithm in cloud computing
since software systems play an important role in applications more than ever, the security has become one of the most important indicators of softwares.cloud computing refers to services that run in a distributed network and are accessible through common internet protocols. presenting a proper scheduling method can lead to efficiency of resources by decreasing response time and costs. this rese...
متن کاملTASA: A New Task Scheduling Algorithm in Cloud Computing
Cloud computing refers to services that run in a distributed network and are accessible through common internet protocols. It merges a lot of physical resources and offers them to users as services according to service level agreement. Therefore, resource management alongside with task scheduling has direct influence on cloud networks’ performance and efficiency. Presenting a proper scheduling ...
متن کاملtasa: a new task scheduling algorithm in cloud computing
cloud computing refers to services that run in a distributed network and are accessible through common internet protocols. it merges a lot of physical resources and offers them to users as services according to service level agreement. therefore, resource management alongside with task scheduling has direct influence on cloud networks’ performance and efficiency. presenting a proper scheduling ...
متن کاملAn Effective Task Scheduling Framework for Cloud Computing using NSGA-II
Cloud computing is a model for convenient on-demand user’s access to changeable and configurable computing resources such as networks, servers, storage, applications, and services with minimal management of resources and service provider interaction. Task scheduling is regarded as a fundamental issue in cloud computing which aims at distributing the load on the different resources of a distribu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Cloud Computing
سال: 2023
ISSN: ['2326-6538']
DOI: https://doi.org/10.1186/s13677-023-00401-1